Two Recursive Generalizations of Iteration in Process Algebra
نویسندگان
چکیده
منابع مشابه
New three-step iteration process and fixed point approximation in Banach spaces
In this paper we propose a new iteration process, called the $K^{ast }$ iteration process, for approximation of fixed points. We show that our iteration process is faster than the existing well-known iteration processes using numerical examples. Stability of the $K^{ast}$ iteration process is also discussed. Finally we prove some weak and strong convergence theorems for Suzuki ge...
متن کاملNew iteration process for approximating fixed points in Banach spaces
The object of this paper is to present a new iteration process. We will show that our process is faster than the known recent iterative schemes. We discuss stability results of our iteration and prove some results in the context of uniformly convex Banach space for Suzuki generalized nonexpansive mappings. We also present a numerical example for proving the rate of convergence of our res...
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملOn two generalizations of semi-projective modules: SGQ-projective and $pi$-semi-projective
Let $R$ be a ring and $M$ a right $R$-module with $S=End_R(M)$. A module $M$ is called semi-projective if for any epimorphism $f:Mrightarrow N$, where $N$ is a submodule of $M$, and for any homomorphism $g: Mrightarrow N$, there exists $h:Mrightarrow M$ such that $fh=g$. In this paper, we study SGQ-projective and $pi$-semi-projective modules as two generalizations of semi-projective modules. A ...
متن کاملUnguarded Recursion on Coinductive Resumptions
A pervasive challenge in programming theory and practice are feature combinations. Here, we propose a semantic framework that combines monad-based computational effects (e.g. store, nondeterminism, random), underdefined or free operations (e.g. actions in process algebra and automata, exceptions), and recursive definitions (e.g. loops, systems of process equations). The joint treatment of these...
متن کامل